When n-cycles in n-partite tournaments are longest cycles
نویسندگان
چکیده
منابع مشابه
When n-cycles in n-partite tournaments are longest cycles
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976 that every strongly connected n-partite tournament has an n-cycle. We characterize strongly connected n-partite tournaments in which a longest cycle is of length n and, thus, settle a problem in L. Volkmann, Discrete Math. 245 (2002) 19-53.
متن کاملOn n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...
متن کاملDiregular c-partite tournaments are vertex-pancyclic when c ≥ 5
In 4] it is conjectured that all diregular c-partite tournaments, with c 4, are pan-cyclic. In this paper we show that all diregular c-partite tournaments, with c 5, are in fact vertex-pancyclic.
متن کاملFrame patterns in n-cycles
In this paper, we study the distribution of the number occurrences of the simplest frame pattern, called the μ pattern, in n-cycles. Given an n-cycle C, we say that a pair 〈i, j〉 matches the μ pattern if i < j and as we traverse around C in a clockwise direction starting at i and ending at j, we never encounter a k with i < k < j. We say that 〈i, j〉 is a nontrivial μ-match if i+ 1 < j. We say t...
متن کاملOriented Hamiltonian Cycles in Tournaments
Let T be a tournament and let D be a digraph. We say that T contains D if D is a subgraph of T. The order of a digraph D, denoted by |D|, is its number of vertices. Let x and y be two vertices of T. We write x y if (x, y) is an arc of T. Likewise, let X and Y be two subdigraphs of T. We write X Y if x y for all pairs (x, y) # V(X )_V(Y ). Let A1 , A2 , ..., Ak be a family of subdigraphs of T. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.10.007